Simple Bounds for Queueing Systems with Breakdowns
نویسنده
چکیده
Computationally attractive and intuitively obvious simple bounds are proposed for finite service systems which are subject to random breakdowns. The services are assumed to be exponential. The up and down periods are allowed to be generally distributed. The bounds are based on product-form modifications and depend only on means. A formal proof is presented. This proof is of interest in itself. Numerical support indicates a potential usefulness for quick engineering and performance evaluation purposes.
منابع مشابه
Bounds and error bounds for queueing networks
Queueing networks are an important means to model and evaluate a variety of practical systems. Unfortunately, analytic results are often not available. Numerical computation may then have to be employed. Or, system modifications might be suggested to obtain simple bounds or computationally easy approximations. Formal analytic support for the accuaracy or nature of such modifications or approxim...
متن کاملSERIE RE5EHRCH mEmORRRDR
Bias terms of Markov reward structures are shown to play a key-role to conclude error bound or monotonicity results for steady state measures when dealing with approximate systems such as due to . perturbations . finite truncations . system modifications, or . system comparisons (bounds) The results are illustrated by a non-product form queueing network example with practical phenomena as block...
متن کاملAnalysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...
متن کاملAnalysis of a Batch Arrival Single Service Queueing System with Unreliable Server and Single Vacation
Many authors have analyzed queueing systems with server breakdowns. Kendall (1953) studied stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Buzacott and Hanifin (1978) classified the machine failures as operation dependent failures and time dependent failures. Shanthikumar (1982) analyzed a M/G/1 queueing system with time and ope...
متن کاملReliability Analysis of the Retrial Queue with Server Breakdowns and Repairs
Retrial queues have been widely used to model many problems arising in telephone switching systems, telecommunication networks, computer networks and computer systems, etc. It is of basic importance to study reliability of retrial queues with server breakdowns and repairs because of limited ability of repairs and heavy influence of the breakdowns on the performance measure of the system. Howeve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Perform. Eval.
دوره 8 شماره
صفحات -
تاریخ انتشار 1988